A Well-behaved LTS for the Pi-calculus
نویسندگان
چکیده
منابع مشابه
A well - behaved LTS for the Pi - calculus (
The pi-calculus and its many variations have received much attention in the literature. We discuss the standard early labelled transition system (lts) and outline an approach which decomposes the system into two components, one of which is presented in detail. The advantages of using the decomposition include a more complete understanding of the treatment of bound outputs in Pi as well as an lt...
متن کاملA Well-behaved LTS for the Pi-calculus: (Abstract)
The Pi-calculus [2,10] is one of the most well-known and widely-studied process calculi – roughly, it extends the binary synchronisations along a channel/name, familiar from ccs, with the ability to pass names as arguments. Thus, the input prefix becomes a binder and the synchronisation itself results in a substitution of the communicated name for the bound variable. The Pi-calculus inherits an...
متن کاملTowards Well-behaved Semantics Suitable for Aggregation towards Well-behaved Semantics Suitable for Aggregation
Real Applications of Databases ask for the support of Ag-gregation. This, however, needs stronger semantics than usual. In particular , such semantics should extend the wellfounded semantics WFS. We study such extensions and determine which semantics are possible given certain abstract properties like partial evaluation, cumulativity, partial monotony and supraclassicality. While WFS + (introdu...
متن کاملA Chart Semantics for the Pi-Calculus
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational semantics. A pi-chart is a finite directed acyclic graph recording a computation in the pi-calculus. Each node represents a process, and each edge either represents a computation step, or a message-passing interaction. P...
متن کاملWell Behaved Transition Systems
The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem. We show coverability decidable for monotone transition systems that only require the absence of infinite antichains and call well behaved transitio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.10.002